SQL Databases are a Moving Target

نویسندگان

  • Juan F. Sequeda
  • Syed Hamid Tirmizi
  • Daniel P. Miranker
چکیده

Our position is founded on two assumptions. First, we assume that the SQL data definition language (SQL-DDL) is capable of encoding substantial domain semantics, albeit not in ways syntactically accessible to inference engines. Second, the layered architecture of the Semantic Web, a.k.a. the layer cake, transcends the Semantic Web. In other words, we assume that the hierarchy of increasingly expressive Semantic Web languages embody a generalizable organizational principle. We do not venture to draw parallels to computational hierarchies. Rather, we cast SQL-DDL into a Semantic-Web like layer cake with the intention to make apparent SQL’s ability to embody semantics and to rationalize the approach of mapping relational databases to the Semantic Web. Even though proportionally few applications exploit the full expressive power of SQL-DDL we show that it is important to develop relational database to Semantic Web mappings that anticipate the full expressive power of SQL.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Moving Objects Databases

Moving objects databases are particular cases of spatiotemporal databases that represent and manage changes related to the movement of objects. Unlike spatio-temporal applications associated with geographic phenomena where the identity of geographic features may change over time, in moving objects databases the objects maintain their identities but change their locations or shapes through time....

متن کامل

Moving Geo Databases to Smart Phones - An Approach for Offline Location-based Applications

Mobile location-based services usually access large geo databases via a wireless network. Sometimes it is useful to store a certain amount of geo objects on the mobile device. In this paper we present an approach to store geo data in an embedded SQL database on smart phones. Besides the storage of geometries in SQL tables we have to provide an efficient geometric indexing mechanism. We used the...

متن کامل

Combining Relational and Semi-structured Databases for an Inquiry Application

The popularity of NoSQL databases keeps growing and more companies have been moving away from relational databases to nonrelational NoSQL databases. In this paper, the partitioning of a relational data model of an inquiry system into semi-structured and relational data for storage in both SQL and NoSQL databases is shown. Furthermore, the CAP theorem will be applied to categorize the storing of...

متن کامل

On the Efficient Gathering of Sufficient Statistics for Classification from Large SQL Databases

For a wide variety of classification algorithms, scalability to large databases can be achieved by observing that most algorithms are driven by a set of sufficient statistics that are significantly smaller than the data. By relying on a SQL backend to compute the sufficient statistics, we leverage the query processing system of SQL databases and avoid the need for moving data to the client. We ...

متن کامل

Sql Server Compare Two Databases Structure

Comparing two databases that were upgraded from Sql Server 2008 R2 to Sql Schema & Data Comparison work well when Sql Client is 2012 SP1, but not. Diffing Your Microsoft SQL Server Database Structures It was lightning-fast, taking less than 8 seconds to compare two databases on different servers. SQL server database project creation using Visual Studio 2013, Author: The work is tougher when we ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007